Achievability Performance Bounds for Integer-Forcing Source Coding
نویسندگان
چکیده
منابع مشابه
Achievability Performance Bounds for Integer-Forcing Source Coding
Integer-forcing source coding has been proposed as a low-complexity method for compression of distributed correlated Gaussian sources. In this scheme, each encoder quantizes its observation using the same fine lattice and reduces the result modulo a coarse lattice. Rather than directly recovering the individual quantized signals, the decoder first recovers a full-rank set of judiciously chosen ...
متن کاملPerformance bounds for fractal coding
This paper reports on investigations concerning the performance of fractal transforms. Emerging from the structural constraints of fractal coding schemes, lower bounds for the reconstruction error are given without regarding quantization noise. This implies finding an at least locally optimal transformation matrix. A full search approach is by definition optimal but also intractable for practic...
متن کاملSource coding bounds using quantizer reproduction levels
Given reasonably chosen fixed sets of reproduction letters and/or their probabilities, the authors define new rate-distortion functions which are coding bounds under these alphabet constraints. Calculations are made of these functions for the Gaussian and Laplacian sources and the squared-error distortion measure and find that performance near the rate-distortion bound is achievable using a rep...
متن کاملCarathéodory bounds for integer cones
Let b ∈ Zd be an integer conic combination of a finite set of integer vectors X ⊂ Zd . In this note we provide upper bounds on the size of a smallest subset X̃ ⊆ X such that b is an integer conic combination of elements of X̃ . We apply our bounds to general integer programming and to the cutting stock problem and provide an NP certificate for the latter, whose existence has not been known so far.
متن کاملLow-Delay Distributed Source Coding: Bounds and Performance of Practical Codes
The performance of distributed source coding methods based on scalar quantization followed by scalar entropy coding is investigated. For a fixed quantizer, the problem is converted to that of zero-error entropy coding for bipartite graphs with a special structure. It is then experimentally shown that for bipartite graphs corresponding to jointly Gaussian sources and high-resolution uniform quan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2950931